منابع مشابه
On Axiom Systems of Pseudo-BCK Algebras
A symplified axiomatization of pseudo-BCK algebras is given. In addition, we obtain a system of axioms defining bounded commutative pseudoBCK algebras and show that these axioms are independent (that is, none follows from the others). 2010 Mathematics Subject Classification: 03G25, 06F05, 06F35
متن کاملOn the Broader Epistemological Significance of Self-Justifying Axiom Systems
This article will be a continuation of our research into selfjustifying systems. It will introduce several new theorems (one of which will transform our previous infinite-sized self-verifying logics into formalisms or purely finite size). It will explain how self-justification is useful, even when the Incompleteness Theorem clearly limits its scope. Citation Information: The manuscript here is ...
متن کاملAxiom-based ontology matching: a method and an experiment
Managing multiple ontologies is now a core question in most of the applications that require semantic interoperability. The Semantic Web is surely the most significant application of this report: the current challenge is not to design, develop and deploy domain ontologies but to define semantic correspondences among multiple ontologies covering overlapping domains. In this paper, we introduce a...
متن کاملCentralized Clustering Method To Increase Accuracy In Ontology Matching Systems
Ontology is the main infrastructure of the Semantic Web which provides facilities for integration, searching and sharing of information on the web. Development of ontologies as the basis of semantic web and their heterogeneities have led to the existence of ontology matching. By emerging large-scale ontologies in real domain, the ontology matching systems faced with some problem like memory con...
متن کاملOn the Data Complexity of Ontology-Mediated Queries with a Covering Axiom
This paper reports on our ongoing work that aims at a classification of conjunctive queries q according to the data complexity of answering ontologymediated queries ({A v T t F}, q). We give examples of queries from the complexity classes C ∈ {AC, L, NL, P, CONP}, and obtain a few syntactical conditions for C-membership and C-hardness.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the Japan Academy, Series A, Mathematical Sciences
سال: 1971
ISSN: 0386-2194
DOI: 10.3792/pja/1195520063